Simple LU and QR Based Non-orthogonal Matrix Joint Diagonalization
نویسنده
چکیده
A class of simple Jacobi-type algorithms for non-orthogonal matrix joint diagonalization based on the LU or QR factorization is introduced. By appropriate parametrization of the underlying manifolds, i.e. using triangular and orthogonal Jacobi matrices we replace a high dimensional minimization problem by a sequence of simple one dimensional minimization problems. In addition, a new scale-invariant cost function for non-orthogonal joint diagonalization is employed. These algorithms are step-size free. Numerical simulations demonstrate the efficiency of the methods.
منابع مشابه
Some Gradient Based Joint Diagonalization Methods for ICA
We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to develop continuous-time flows for joint diagonalization and derive their discretized versions. We employ the developed methods to construct a class of Independent Component Analysis (ICA) algorithms based on non-orthogonal joint dia...
متن کاملSimultaneous Source Localization and Polarization Estimation via Non-Orthogonal Joint Diagonalization with Vector-Sensors
Joint estimation of direction-of-arrival (DOA) and polarization with electromagnetic vector-sensors (EMVS) is considered in the framework of complex-valued non-orthogonal joint diagonalization (CNJD). Two new CNJD algorithms are presented, which propose to tackle the high dimensional optimization problem in CNJD via a sequence of simple sub-optimization problems, by using LU or LQ decomposition...
متن کاملComplex Non-Orthogonal Joint Diagonalization Based on LU and LQ Decompositions
In this paper, we propose a class of complex non-orthogonal joint diagonalization (NOJD) algorithms with successive rotations. The proposed methods consider LU or LQ decompositions of the mixing matrices, and propose to solve the NOJD problem via two successive stages: L-stage and U (or Q)-stage. Moreover, as the manifolds of target matrices in these stages could be appropriately parameterized ...
متن کاملOn the spectra of some matrices derived from two quadratic matrices
begin{abstract} The relations between the spectrum of the matrix $Q+R$ and the spectra of the matrices $(gamma + delta)Q+(alpha + beta)R-QR-RQ$, $QR-RQ$, $alpha beta R-QRQ$, $alpha RQR-(QR)^{2}$, and $beta R-QR$ have been given on condition that the matrix $Q+R$ is diagonalizable, where $Q$, $R$ are ${alpha, beta}$-quadratic matrix and ${gamma, delta}$-quadratic matrix, respectively, of ord...
متن کاملA Fast Algorithm for Joint Diagonalization with Non-orthogonal Transformations and its Application to Blind Source Separation
A new efficient algorithm is presented for joint diagonalization of several matrices. The algorithm is based on the Frobenius-norm formulation of the joint diagonalization problem, and addresses diagonalization with a general, non-orthogonal transformation. The iterative scheme of the algorithm is based on a multiplicative update which ensures the invertibility of the diagonalizer. The algorith...
متن کامل